Sciweavers

223 search results - page 44 / 45
» Pattern Search Methods for Linearly Constrained Minimization
Sort
View
PPOPP
2010
ACM
14 years 4 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...
JCB
2007
118views more  JCB 2007»
13 years 7 months ago
Discovering Topological Motifs Using a Compact Notation
Discovering topological motifs or common topologies in one or more graphs is an important as well as an interesting problem. It had been classically viewed as the subgraph isomorp...
Laxmi Parida
MM
2010
ACM
402views Multimedia» more  MM 2010»
13 years 5 months ago
Discriminative codeword selection for image representation
Bag of features (BoF) representation has attracted an increasing amount of attention in large scale image processing systems. BoF representation treats images as loose collections...
Lijun Zhang 0005, Chun Chen, Jiajun Bu, Zhengguang...
AAAI
2006
13 years 8 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer
SIAMIS
2010
171views more  SIAMIS 2010»
13 years 2 months ago
Global Optimization for One-Dimensional Structure and Motion Problems
We study geometric reconstruction problems in one-dimensional retina vision. In such problems, the scene is modeled as a 2D plane, and the camera sensor produces 1D images of the s...
Olof Enqvist, Fredrik Kahl, Carl Olsson, Kalle &Ar...