69 search results - page 4 / 14 » Maximal Intersection Queries in Randomized Input Models |
ICASSP
2010
IEEE
15 years 16 days ago
2010
IEEE
We present a novel language identification technique using our recently developed deep-structured conditional random fields (CRFs). The deep-structured CRF is a multi-layer CRF mo...
112
Voted
SIGMOD
2004
ACM
16 years 15 days ago
2004
ACM
We define a framework for static optimization of sliding window conjunctive queries over infinite streams. When computational resources are sufficient, we propose that the goal of...
123
Voted
PODS
2005
ACM
16 years 14 days ago
2005
ACM
We consider a scenario where we want to query a large dataset that is stored in external memory and does not fit into main memory. The most constrained resources in such a situati...
102
click to vote
COLT
1992
Springer
15 years 4 months ago
1992
Springer
We propose an algorithm called query by committee, in which a committee of students is trained on the same data set. The next query is chosen according to the principle of maximal...
112
Voted
ICALP
2004
Springer
15 years 5 months ago
2004
Springer
We consider the following scheduling problem. The input is a set of jobs with equal processing times, where each job is specified by its release time and deadline. The goal is to ...