Sciweavers

971 search results - page 12 / 195
» Planning with Reduced Operator Sets
Sort
View
SIGMOD
2004
ACM
204views Database» more  SIGMOD 2004»
15 years 10 months ago
Buffering Database Operations for Enhanced Instruction Cache Performance
As more and more query processing work can be done in main memory, memory access is becoming a significant cost component of database operations. Recent database research has show...
Jingren Zhou, Kenneth A. Ross
OSDI
2004
ACM
15 years 10 months ago
MapReduce: Simplified Data Processing on Large Clusters
MapReduce is a programming model and an associated implementation for processing and generating large data sets. Users specify a map function that processes a key/value pair to ge...
Jeffrey Dean, Sanjay Ghemawat
ICASSP
2011
IEEE
14 years 1 months ago
Towards reduced false-alarms using cohorts
The focus of the 2010 NIST Speaker Recognition Evaluation (SRE) [1] was the low false alarm regime of the detection error trade-off (DET) curve. This paper presents several approa...
Zahi N. Karam, William M. Campbell, Najim Dehak
AAAI
2008
15 years 6 days ago
Hypothesis Pruning and Ranking for Large Plan Recognition Problems
This paper addresses the problem of plan recognition for multi-agent teams. Complex multi-agent tasks typically require dynamic teams where the team membership changes over time. ...
Gita Sukthankar, Katia P. Sycara
FUIN
2007
95views more  FUIN 2007»
14 years 9 months ago
Compositional Systems over Reducible Networks
Abstract. In the paper two notions related to local (distributed) computations are identified and discussed. The first one is the notion of reducible graphs. A graph is reducible...
Antoni W. Mazurkiewicz