Sciweavers

960 search results - page 58 / 192
» CURE: An Efficient Clustering Algorithm for Large Databases
Sort
View
151
Voted
JCIT
2010
174views more  JCIT 2010»
14 years 10 months ago
Efficient Ming of Top-K Closed Sequences
Sequence mining is an important data mining task. In order to retrieve interesting sequences from a large database, a minimum support threshold is needed to be specified. Unfortun...
Panida Songram
137
Voted
DASFAA
2006
IEEE
174views Database» more  DASFAA 2006»
15 years 7 months ago
Communication-Efficient Implementation of Range-Joins in Sensor Networks
Sensor networks are multi-hop wireless networks of resource constrained sensor nodes used to realize high-level collaborative sensing tasks. To query and access data generated and ...
Aditi Pandit, Himanshu Gupta
ICDE
2010
IEEE
271views Database» more  ICDE 2010»
16 years 3 months ago
Preference Queries in Large Multi-Cost Transportation Networks
Research on spatial network databases has so far considered that there is a single cost value associated with each road segment of the network. In most real-world situations, howev...
Kyriakos Mouratidis, Yimin Lin, Man Lung Yiu
129
Voted
ICASSP
2008
IEEE
15 years 10 months ago
Fast query by example of environmental sounds via robust and efficient cluster-based indexing
There has been much recent progress in the technical infrastructure necessary to continuously characterize and archive all sounds, or more precisely auditory streams, that occur w...
Jiachen Xue, Gordon Wichern, Harvey D. Thornburg, ...
122
Voted
IPPS
2009
IEEE
15 years 10 months ago
A metascalable computing framework for large spatiotemporal-scale atomistic simulations
A metascalable (or “design once, scale on new architectures”) parallel computing framework has been developed for large spatiotemporal-scale atomistic simulations of materials...
Ken-ichi Nomura, Richard Seymour, Weiqiang Wang, H...