Sciweavers

8512 search results - page 1672 / 1703
» Computing Theory With Relevance
Sort
View
COMPGEOM
2005
ACM
13 years 10 months ago
Cache-oblivious r-trees
We develop a cache-oblivious data structure for storing a set S of N axis-aligned rectangles in the plane, such that all rectangles in S intersecting a query rectangle or point ca...
Lars Arge, Mark de Berg, Herman J. Haverkort
DIALM
2005
ACM
130views Algorithms» more  DIALM 2005»
13 years 10 months ago
On lower bounds for MAC layer contention in CSMA/CA-based wireless networks
Wireless LANs operating within unlicensed frequency bands require random access schemes such as CSMA/CA, so that wireless networks from different administrative domains (for exam...
Frank A. Zdarsky, Ivan Martinovic, Jens B. Schmitt
DIALM
2005
ACM
125views Algorithms» more  DIALM 2005»
13 years 10 months ago
Minimizing interference in ad hoc and sensor networks
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
Thomas Moscibroda, Roger Wattenhofer
CIVR
2008
Springer
125views Image Analysis» more  CIVR 2008»
13 years 9 months ago
Leveraging user query log: toward improving image data clustering
Image clustering is useful in many retrieval and classification applications. The main goal of image clustering is to partition a given dataset into salient clusters such that the...
Hao Cheng, Kien A. Hua, Khanh Vu
DIMEA
2007
132views Multimedia» more  DIMEA 2007»
13 years 9 months ago
On the production of creative subjectivity
Businesses today are requiring higher levels of creativity and innovation in the face of rapid change, fierce competition and increasingly complex markets. Nowhere is the more obv...
Brett Rolfe
« Prev « First page 1672 / 1703 Last » Next »