7930 search results - page 1258 / 1586 » Greedy in Approximation Algorithms |
166
click to vote
IMC
2007
ACM
15 years 7 months ago
2007
ACM
The ability to discover network organization, whether in the form of explicit topology reconstruction or as embeddings that approximate topological distance, is a valuable tool. T...
173
click to vote
GRAPHICSINTERFACE
2008
15 years 7 months ago
2008
Recently, several soft shadow mapping algorithms have been introduced which extract micro-occluders from a shadow map and backproject them on the light source to approximately det...
167
click to vote
ICVGIP
2008
15 years 7 months ago
2008
The primitives of point-based representations are independent but are rendered using surfels, which approximate the immediate neighborhood of each point linearly. A large number o...
164
click to vote
NIPS
2007
15 years 7 months ago
2007
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known ...
181
click to vote
ICDE
2010
IEEE
15 years 6 months ago
2010
IEEE
— Emerging uncertain database applications often involve the cleansing (conditioning) of uncertain databases using additional information as new evidence for reducing the uncerta...