Loading...
Search for:
ghodsi--h
0.115 seconds
List View
Gallery View
| # | Type | Title | Author | Publisher | Pub. Year | Subjects | Call Number |
|---|---|---|---|---|---|---|---|
| 1 | مقاله | Approximate minimum diameter | Ghodsi, M. | Springer Verlag, | 2017 |
Approximation algorithms.
Core-set. Imprecise. Indecisive. Combinatorial mathematics. Computational geometry. Polynomial approximation. Core set. D-dimensional spaces. Indecisive. Lower bounds. Minimum diameters. Polynomial-time. Precise locations. |
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
|
| 2 | مقاله | Simultaneous joint and object trajectory templates for human activity recognition from 3-D data | Ghodsi, S. | Academic Press Inc, | 2018 |
Action template.
Dynamic time warping (DTW) Human activity recognition. Human object interaction. RGB-D sensors. Trajectory-based representation. Pattern recognition. Dynamic time warping. Human-object interaction. Rgb-d sensors. Trajectory-based. Trajectories. |
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
|
| 3 | مقاله | Maximin share guarantee for goods with positive externalities | Seddighin, M. | Springer, | 2020 |
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
|
|
| 4 | مقاله | Maximin share guarantee for goods with positive externalities | Seddighin, M. | Springer Science and Business Media Deutschland GmbH, | 2021 |
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
|
|
| 5 | مقاله | Range-free passive acoustic localization | Abrahami Saba, A. | 2008 |
Acoustic localizations.
Acoustic sensors. Bayesian filtering. Clustering techniques. Range-free. Simulation experiments. Intelligent control. Sensor networks. Smart sensors. Wireless sensor networks. Acoustics. |
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
|
|
| 6 | مقاله | Permutation betting markets: Singleton betting with extra information | Ghodsi, M. | 2011 |
Combinatorial algorithms.
Linear programming. Prediction markets. Revenue maximization. Betting markets. Combinatorial algorithm. Matching markets. Revenue maximization. Algorithms. Electronic commerce. Polynomials. Set theory. Problem solving. |
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
|
|
| 7 | مقاله | Gravity on noncommutative D-branes | Ardalan, F. | 2003 |
D-branes.
Gravity. Noncommutativity. |
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
|
|
| 8 | مقاله | Almost three decades of IOI in Iran | Ghodsi, M. | Vilnius University, | 2017 |
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
|
|
| 9 | مقاله | Modeling performance of distributed programs by stochastic decision free petri nets | Ghodsi, M. | Sharif University of Technology, | 2001 | Computer program. |
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
|
| 10 | مقاله | Fair allocation of indivisible goods: improvements and generalizations | Ghodsi, M. | Association for Computing Machinery, Inc, | 2018 |
Polynomial approximation.
Allocation methods. Approximation solution. Double counting. Fair allocation. Indivisible good. Logarithmic approximation. Polynomial-time. Valuation function. Approximation algorithms. |
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
|
| 11 | مقاله | Permutation betting markets: singleton betting with extra information | Ghodsi, M. | 2008 |
Arbitrary values.
Betting markets. Combinatorial algorithm. Expected revenue. Free model. Optimum solution. P-complete. Polynomial-time. Polynomial-time algorithms. Prediction markets. Revenue maximization. Revenue maximization problem. Sufficient conditions. Combinatorial mathematics. Dynamic programming. Electric conductivity measurement. Electronic commerce. Linearization. Problem solving. Set theory. Optimization. |
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
|
|
| 12 | مقاله | Parallel online ranking of web pages | Ganji Saffar, Y. | IEEE Computer Society, | 2006 |
Algorithms.
Computational methods. Computer graphics. Indexing (of information) Query languages. Search engines. Websites. Online ranking. Ranking algorithms. Web graphs. Online searching. |
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
|
| 13 | مقاله | Web graph compression by edge elimination | Mahdian, A. | 2006 |
Density measurement.
Data structures. Radio access networks. Testing. Data compression. |
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
|
|
| 14 | مقاله | Fair allocation of indivisible goods: Beyond additive valuations | Ghodsi, M. | Elsevier B.V, | 2022 |
Polynomial approximation.
'current. Approximation. Fair allocation. Fairness. Indivisible good. Maximin. Maximin-share. Subadditive. Submodular. XOS. Additives. |
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
|
| 15 | مقاله | Fair allocation of indivisible goods: Improvement | Ghodsi, M. | INFORMS Inst.for Operations Res.and the Management Sciences, | 2021 |
Computer applications.
Research. Approximation results. Combinatorial assignment. Competitive equilibrium. Fair allocation. Impossibility results. Indivisible good. Maximin. Utility functions. Combinatorial optimization. |
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
|
| 16 | مقاله | α-visibility | Ghodsi, M. | 2012 |
Line segment.
Query time. Visibility graphs. Algorithms. Visibility. |
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
|
|
| 17 | پایان نامه | محاسبه ی کارای فضای قابل دید و ساده سازی آن در محیطهای مختلف Efficient Visibility Computation and Simplification in Different Environments | زارعی، علیرضا Zarei, Alireza | صنعتی شریف | 1387 | هندسه محاسباتی Computational Geometry / الگوریتم جویباری Streaming Algorithm / الگوریتم قابلیت دید Visibility Algorithm / ساده سازی مسیر Line Simplification |
19-39026
|
| 18 | پایان نامه | الگوریتم هایی برای رهگیری نقاط متحرک Algorithms for Tracking Moving Points | منصوری، حمید Mansouri, Hamid | صنعتی شریف | 1388 | تحمل پذیری خطا Fault Tolerance / حسگرهای دودویی پرتوی Binary Beam Sensors / رهگیری نقاط متحرک Tracking Moving Points / جداسازی مسیر Path Separation / مساله حداقل هزینه، حداکثر شارژ با هزینه ثابت Fixed-Charge Minimum Cost Maximum Flow Problem |
19-40575
|
| 19 | پایان نامه | تحلیل انتشار در شبکه های اجتماعی مبتنی بر نظریه بازی ها Diffusion of Innovations in Social Networks Based on Game Theoretic Approaches | افتخار، میلاد Eftekhar, Milad | صنعتی شریف | 1388 | شبکه های اجتماعی Social Networks / طراحی مکانیزم Mechanism Design / بازاریابی ویروسی Viral Marketing / گره های تاثیرگذار Influential Nodes / گروه بندی چندعضویتی Group-Based Diffusion / نقص اطلاعات Information Absence |
19-39562
|
| 20 | پایان نامه | بیشینه سازی سود فروشنده در بازارهای اجتماعی Profit Maximization of Sellers in Social Markets | مهینی، حمید Mahini, Hamid | صنعتی شریف | 1389 | الگوریتم Algorithm / نظریه بازی Game Theory / شبکه های اجتماعی Social Networks / بهینه سازی Optimization / بیشینه سازی سود Profit Maximization / بازارهای اجتماعی Social Markets |
19-41463
|