7930 search results - page 545 / 1586 » Greedy in Approximation Algorithms |
213
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
175
click to vote
ACMICEC
2007
ACM
15 years 11 months ago
2007
ACM
This paper introduces algorithms for learning how to trade using insider (superior) information in Kyle's model of financial markets. Prior results in finance theory relied o...
197
click to vote
BIBM
2009
IEEE
15 years 11 months ago
2009
IEEE
We describe an algorithm for finding approximate seeds for DNA homology searches. In contrast to previous algorithms that use exact or spaced seeds, our approximate seeds may conta...
299
click to vote
VLDB
2005
ACM
16 years 7 months ago
2005
ACM
Abstract Declarative queries are proving to be an attractive paradigm for interacting with networks of wireless sensors. The metaphor that "the sensornet is a database" i...
313
click to vote
SIGMOD
2007
ACM
16 years 7 months ago
2007
ACM
Declarative data quality has been an active research topic. The fundamental principle behind a declarative approach to data quality is the use of declarative statements to realize...