Sciweavers

7129 search results - page 1037 / 1426
» Approximation Algorithms for Treewidth
Sort
View
VC
1998
66views more  VC 1998»
15 years 4 months ago
Vertex representations and their applications in computer graphics
The vertex representation, a new data structure for representing and manipulating orthogonal objects, is presented. Both interiors and boundaries of regions are represented implic...
Claudio Esperança, Hanan Samet
MP
2007
100views more  MP 2007»
15 years 3 months ago
Power optimization for connectivity problems
Given a graph with costs on the edges, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of the nodes of this graph...
Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. ...
NECO
2007
127views more  NECO 2007»
15 years 3 months ago
Visual Recognition and Inference Using Dynamic Overcomplete Sparse Learning
We present a hierarchical architecture and learning algorithm for visual recognition and other visual inference tasks such as imagination, reconstruction of occluded images, and e...
Joseph F. Murray, Kenneth Kreutz-Delgado
TC
2011
14 years 11 months ago
Improved Division by Invariant Integers
—This paper considers the problem of dividing a two-word integer by a single-word integer, together with a few extensions and applications. Due to lack of efficient division ins...
Niels Moller, Torbjörn Granlund
AAMAS
2011
Springer
14 years 11 months ago
Aggregating value ranges: preference elicitation and truthfulness
We study the case where agents have preferences over ranges (intervals) of values, and we wish to elicit and aggregate these preferences. For example, consider a set of climatologi...
Joseph Farfel, Vincent Conitzer
« Prev « First page 1037 / 1426 Last » Next »