Sciweavers

514 search results - page 89 / 103
» Packet Classification Algorithms: From Theory to Practice
Sort
View
INFOCOM
2009
IEEE
14 years 2 months ago
Capacity of Arbitrary Wireless Networks
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...
Olga Goussevskaia, Roger Wattenhofer, Magnú...
SMA
2003
ACM
132views Solid Modeling» more  SMA 2003»
14 years 24 days ago
Tight cocone: a water-tight surface reconstructor
Surface reconstruction from unorganized sample points is an important problem in computer graphics, computer aided design, medical imaging and solid modeling. Recently a few algor...
Tamal K. Dey, Samrat Goswami
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 7 months ago
Deploying Wireless Networks with Beeps
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...
Alejandro Cornejo, Fabian Kuhn
KDD
2008
ACM
161views Data Mining» more  KDD 2008»
14 years 8 months ago
Locality sensitive hash functions based on concomitant rank order statistics
: Locality Sensitive Hash functions are invaluable tools for approximate near neighbor problems in high dimensional spaces. In this work, we are focused on LSH schemes where the si...
Kave Eshghi, Shyamsundar Rajaram
IEAAIE
2009
Springer
14 years 2 months ago
Incremental Mining of Ontological Association Rules in Evolving Environments
The process of knowledge discovery from databases is a knowledge intensive, highly user-oriented practice, thus has recently heralded the development of ontology-incorporated data ...
Ming-Cheng Tseng, Wen-Yang Lin