4526 search results - page 598 / 906 » Algorithmic problems related to the Internet |
221
click to vote
CONSTRAINTS
1998
15 years 6 months ago
1998
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
273
click to vote
ICDT
2009
ACM
16 years 7 months ago
2009
ACM
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
183
Voted
SIGMOD
2001
ACM
16 years 6 months ago
2001
ACM
We study the problem of generating e cient, equivalent rewritings using views to compute the answer to a query. We take the closed-world assumption, in which views are materialize...
170
click to vote
BIOINFORMATICS
2007
15 years 6 months ago
2007
Motivation: Genome maps are fundamental to the study of an organism and essential in the process of genome sequencing which in turn provides the ultimate map of the genome. The in...
172
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
Two decades ago, Megiddo and Dyer showed that linear programming in two and three dimensions (and subsequently any constant number of dimensions) can be solved in linear time. In ...