Sciweavers

1430 search results - page 248 / 286
» Query operations for moving objects database systems
Sort
View
WSDM
2009
ACM
104views Data Mining» more  WSDM 2009»
15 years 4 months ago
Top-k aggregation using intersections of ranked inputs
There has been considerable past work on efficiently computing top k objects by aggregating information from multiple ranked lists of these objects. An important instance of this...
Ravi Kumar, Kunal Punera, Torsten Suel, Sergei Vas...
DAIS
2001
14 years 11 months ago
Sentient Computing for Everyone
: Sentient Computing gives perception to computing systems so that they can detect, interpret and respond to changing aspects of users' context. The location attribute of a us...
Diego López de Ipiña, Sai Lai Lo
ICDE
2012
IEEE
227views Database» more  ICDE 2012»
13 years 13 days ago
Temporal Analytics on Big Data for Web Advertising
—“Big Data” in map-reduce (M-R) clusters is often fundamentally temporal in nature, as are many analytics tasks over such data. For instance, display advertising uses Behavio...
Badrish Chandramouli, Jonathan Goldstein, Songyun ...
CBMS
2002
IEEE
15 years 3 months ago
CyclopsDistMedDB. - A Transparent Gateway for Distributed Medical Data Access in DICOM Format
The image diagnosis area is the most propense medical field to Telemedicine, because it does not obligate a direct contact of the patient with the responsible radiologist during t...
Leonardo Ribeiro, Paulo Roberto Dellani, Aldo von ...
VLDB
1997
ACM
170views Database» more  VLDB 1997»
15 years 1 months ago
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
A new access method, called M-tree, is proposed to organize and search large data sets from a generic "metric space", i.e. where object proximity is only defined by a di...
Paolo Ciaccia, Marco Patella, Pavel Zezula