7006 search results - page 401 / 1402 » Approximation Algorithms |
138
click to vote
TOC
2008
15 years 4 months ago
2008
Abstract: Schnorr's algorithm for finding an approximation for the shortest nonzero vector in an n-dimensional lattice depends on a parameter k. He proved that for a fixed k ...
248
click to vote
SIGMOD
2005
ACM
16 years 4 months ago
2005
ACM
Complex queries over high speed data streams often need to rely on approximations to keep up with their input. The research community has developed a rich literature on approximat...
139
Voted
ICML
1996
IEEE
16 years 5 months ago
1996
IEEE
In this paper, we examine a method for feature subset selection based on Information Theory. Initially, a framework for de ning the theoretically optimal, but computationally intr...
152
click to vote
OPODIS
2007
15 years 6 months ago
2007
Peer to peer overlay networks have proven to be a good support for storing and retrieving data in a fully decentralized way. A sound approach is to structure them in such a way tha...
155
click to vote
TSP
2008
15 years 4 months ago
2008
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...