Sciweavers

5962 search results - page 1110 / 1193
» Efficient Clustering for Orders
Sort
View
IPL
2002
125views more  IPL 2002»
15 years 6 months ago
A note concerning the closest point pair algorithm
An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove t...
Martin Richards
TPDS
2002
141views more  TPDS 2002»
15 years 5 months ago
Integration of Pricing with Call Admission Control to Meet QoS Requirements in Cellular Networks
Call Admission Control (CAC) plays a significant role in providing the desired Quality of Service (QoS) in cellular networks. Traditional CAC schemes that mainly focus on the trade...
Jiongkuan Hou, Jie Yang, Symeon Papavassiliou
PVLDB
2008
128views more  PVLDB 2008»
15 years 5 months ago
Hexastore: sextuple indexing for semantic web data management
Despite the intense interest towards realizing the Semantic Web vision, most existing RDF data management schemes are constrained in terms of efficiency and scalability. Still, th...
Cathrin Weiss, Panagiotis Karras, Abraham Bernstei...
ECCV
2010
Springer
15 years 4 months ago
Discriminative Nonorthogonal Binary Subspace Tracking
Visual tracking is one of the central problems in computer vision. A crucial problem of tracking is how to represent the object. Traditional appearance-based trackers are using inc...
Ang Li, Feng Tang, Yanwen Guo, Hai Tao
MOBIHOC
2010
ACM
15 years 4 months ago
Near optimal multi-application allocation in shared sensor networks
Recent years have witnessed the emergence of shared sensor networks as integrated infrastructure for multiple applications. It is important to allocate multiple applications in a ...
You Xu, Abusayeed Saifullah, Yixin Chen, Chenyang ...
« Prev « First page 1110 / 1193 Last » Next »