Sciweavers

1141 search results - page 193 / 229
» Experiences and directions in pushpin computing
Sort
View
ICML
2006
IEEE
16 years 19 days ago
Learning hierarchical task networks by observation
Knowledge-based planning methods offer benefits over classical techniques, but they are time consuming and costly to construct. There has been research on learning plan knowledge ...
Negin Nejati, Pat Langley, Tolga Könik
WWW
2009
ACM
16 years 15 days ago
Query clustering using click-through graph
In this paper we describe a problem of discovering query clusters from a click-through graph of web search logs. The graph consists of a set of web search queries, a set of pages ...
Jeonghee Yi, Farzin Maghoul
WWW
2008
ACM
16 years 15 days ago
Offline matching approximation algorithms in exchange markets
Motivated by several marketplace applications on rapidly growing online social networks, we study the problem of efficient offline matching algorithms for online exchange markets....
Zeinab Abbassi, Laks V. S. Lakshmanan
WWW
2003
ACM
16 years 15 days ago
Delivering Semantic Web Services
The growing infrastructure for Web Services assumes a "programmer in the loop" that hardcodes the connections between Web Services and directly programs Web Service comp...
Massimo Paolucci, Katia P. Sycara, Takahiro Kawamu...
VLDB
2007
ACM
181views Database» more  VLDB 2007»
16 years 1 days ago
STAR: Self-Tuning Aggregation for Scalable Monitoring
We present STAR, a self-tuning algorithm that adaptively sets numeric precision constraints to accurately and efficiently answer continuous aggregate queries over distributed data...
Navendu Jain, Michael Dahlin, Yin Zhang, Dmitry Ki...