989 search results - page 150 / 198 » Version spaces and the consistency problem |
166
click to vote
STOC
2009
ACM
16 years 6 months ago
2009
ACM
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
179
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
167
click to vote
ISCA
2008
IEEE
16 years 8 days ago
2008
IEEE
Recently, Network-on-Chip (NoC) architectures have gained popularity to address the interconnect delay problem for designing CMP / multi-core / SoC systems in deep sub-micron tech...
162
Voted
INFOCOM
2003
IEEE
15 years 11 months ago
2003
IEEE
— The problem of efficient data structures for IP lookups has been well studied in literature. Techniques such as LC tries and Extensible Hashing are commonly used. In this pape...
159
Voted
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...