1389 search results - page 206 / 278 » Improved Approximation Algorithms for Label Cover Problems |
136
Voted
SIGMOD
1999
ACM
15 years 7 months ago
1999
ACM
Classification is an important data mining problem. Given a training database of records, each tagged with a class label, the goal of classification is to build a concise model ...
216
click to vote
ICDE
2005
IEEE
16 years 4 months ago
2005
IEEE
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
172
click to vote
TASE
2010
IEEE
14 years 9 months ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
136
Voted
NIPS
2007
15 years 4 months ago
2007
Stability is a desirable characteristic for linear dynamical systems, but it is often ignored by algorithms that learn these systems from data. We propose a novel method for learn...
136
click to vote
GD
2008
Springer
15 years 3 months ago
2008
Springer
A nonplanar graph G is near-planar if it contains an edge e such that G − e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from di...