Sciweavers

1211 search results - page 225 / 243
» Computing Manipulations of Ranking Systems
Sort
View
ICDE
2000
IEEE
161views Database» more  ICDE 2000»
13 years 11 months ago
Efficient Query Refinement in Multimedia Databases
Increasing application demands are pushing database management systems (DBMSs) towards providing adequate and efficient support for content-based retrieval over multimedia objects...
Kaushik Chakrabarti, Kriengkrai Porkaew, Sharad Me...
RIAO
2007
13 years 9 months ago
Capturing Sentence Prior for Query-Based Multi-Document Summarization
In this paper, we have considered a real world information synthesis task, generation of a fixed length multi document summary which satisfies a specific information need. This...
Jagadeesh Jagarlamudi, Prasad Pingali, Vasudeva Va...
ICFP
2003
ACM
14 years 7 months ago
FreshML: programming with binders made simple
FreshML extends ML with elegant and practical constructs for declaring and manipulating syntactical data involving statically scoped binding operations. User-declared FreshML data...
Mark R. Shinwell, Andrew M. Pitts, Murdoch Gabbay
ICWS
2009
IEEE
14 years 4 months ago
MACE: A Dynamic Caching Framework for Mashups
—The recent surge of popularity has established Mashups as an important category of Web 2.0 applications. Mashups are essentially Web services that are often created by end-users...
Osama Al-Haj Hassan, Lakshmish Ramaswamy, John A. ...
EDBT
2010
ACM
177views Database» more  EDBT 2010»
14 years 2 months ago
Bridging the gap between intensional and extensional query evaluation in probabilistic databases
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...
Abhay Jha, Dan Olteanu, Dan Suciu