3875 search results - page 516 / 775 » Approximation algorithms for the 0-extension problem |
259
Voted
ICDE
2011
IEEE
14 years 10 months ago
2011
IEEE
— Array database systems are architected for scientific and engineering applications. In these applications, the value of a cell is often imprecise and uncertain. There are at le...
232
click to vote
FGR
2011
IEEE
14 years 10 months ago
2011
IEEE
—An expression can be approximated by a sequence of temporal segments called neutral, onset, offset and apex. However, it is not easy to accurately detect such temporal segments ...
163
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
Low-rank matrix decompositions are essential tools in the application of kernel methods to large-scale learning problems. These decompositions have generally been treated as black...
160
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
A flow is said to be confluent if at any node all the flow leaves along a single edge. Given a directed graph G with k sinks and non-negative demands on all the nodes of G, we con...
182
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
This paper deals with the reconstruction of smooth, flexible, isometrically embedded flat surfaces in 3D, such as a sheet of paper or a flag waving in the wind, from a set of 2...