Sciweavers

74 search results - page 13 / 15
» Algorithms for Generating Convex Sets in Acyclic Digraphs
Sort
View
89
Voted
ICNP
2007
IEEE
15 years 6 months ago
Greedy Virtual Coordinates for Geographic Routing
— We present a new approach for generating virtual coordinates that produces usable coordinates quickly and improves the routing performance of existing geographic routing algori...
Ben Leong, Barbara Liskov, Robert Morris
CVPR
2010
IEEE
15 years 6 months ago
Weakly-Supervised Hashing in Kernel Space
The explosive growth of the vision data motivates the recent studies on efficient data indexing methods such as locality-sensitive hashing (LSH). Most existing approaches perform...
Yadong Mu, Jialie Shen, Shuicheng Yan
130
Voted
SIGGRAPH
1998
ACM
15 years 4 months ago
Visibility Sorting and Compositing Without Splitting for Image Layer Decompositions
We present an efficient algorithm for visibility sorting a set of moving geometric objects into a sequence of image layers which are composited to produce the final image. Inste...
John M. Snyder, Jed Lengyel
ISAAC
2003
Springer
101views Algorithms» more  ISAAC 2003»
15 years 5 months ago
Rapid Mixing of Several Markov Chains for a Hard-Core Model
The mixing properties of several Markov chains to sample from configurations of a hard-core model have been examined. The model is familiar in the statistical physics of the liqui...
Ravi Kannan, Michael W. Mahoney, Ravi Montenegro
ATAL
2008
Springer
15 years 2 months ago
An agent-based electrical power market
This demonstration shows an agent-based model for the electricity power market, in which the optimal power flow is determined in a bottom-up fashion. Here, each agent controls a s...
Jaime Cerda Jacobo, David De Roure, Enrico H. Gerd...