Sciweavers

361 search results - page 33 / 73
» Maximum subset intersection
Sort
View
CORR
2008
Springer
141views Education» more  CORR 2008»
15 years 2 months ago
Obfuscated Drawings of Planar Graphs
Given a planar graph G, we consider drawings of G in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an i...
Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Math...
147
Voted
HICSS
2003
IEEE
103views Biometrics» more  HICSS 2003»
15 years 7 months ago
Wireless Sensor Placement For Reliable and Efficient Data Collection
Sensors can be paired with radio units and deployed to form a wireless ad-hoc sensor network. Actual deployments must consider the coverage that can be achieved with a given numbe...
Edoardo S. Biagioni, Galen H. Sasaki
JAL
2006
89views more  JAL 2006»
15 years 2 months ago
Improved bounds for the unsplittable flow problem
In this paper we consider the unsplittable flow problem (UFP): given a directed or undirected network G = (V, E) with edge capacities and a set of terminal pairs (or requests) wit...
Petr Kolman, Christian Scheideler
PAMI
1998
127views more  PAMI 1998»
15 years 1 months ago
The Random Subspace Method for Constructing Decision Forests
—Much of previous attention on decision trees focuses on the splitting criteria and optimization of tree sizes. The dilemma between overfitting and achieving maximum accuracy is ...
Tin Kam Ho
ADHOCNOW
2004
Springer
15 years 7 months ago
Improving Distance Based Geographic Location Techniques in Sensor Networks
Supporting nodes without Global Positioning System (GPS) capability, in wireless ad hoc and sensor networks, has numerous applications in guidance and surveying systems in use toda...
Michel Barbeau, Evangelos Kranakis, Danny Krizanc,...