Sciweavers

2593 search results - page 195 / 519
» Algorithms and Data Structures for Computer Topology
Sort
View
SWAT
2000
Springer
90views Algorithms» more  SWAT 2000»
15 years 10 months ago
Efficient Expected-Case Algorithms for Planar Point Location
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh...
KI
2010
Springer
15 years 4 months ago
Positions, Regions, and Clusters: Strata of Granularity in Location Modelling
Location models are data structures or knowledge bases used in Ubiquitous Computing for representing and reasoning about spatial relationships between so-called smart objects, i.e....
Hedda Rahel Schmidtke, Michael Beigl
SCP
1998
112views more  SCP 1998»
15 years 6 months ago
Structured Gamma
The Gamma language is based on the chemical reaction metaphor which has a number of benefits with respect to parallelism and program derivation. But the original definition of G...
Pascal Fradet, Daniel Le Métayer
159
Voted
INFOCOM
2007
IEEE
16 years 19 days ago
Distributed Low-Complexity Maximum-Throughput Scheduling for Wireless Backhaul Networks
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...
Abdul Kader Kabbani, Theodoros Salonidis, Edward W...
175
Voted
INFOCOM
2007
IEEE
16 years 19 days ago
Acyclic Type of Relationships Between Autonomous Systems
Abstract— The Internet connectivity in the Autonomous System (AS) level reflects the commercial relationship between ASes. A connection between two ASes could be of type custome...
Rami Cohen, Danny Raz