Sciweavers

265 search results - page 41 / 53
» The independence number in graphs of maximum degree three
Sort
View
COLT
2003
Springer
15 years 2 months ago
On Finding Large Conjunctive Clusters
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
Nina Mishra, Dana Ron, Ram Swaminathan
JSAC
2011
116views more  JSAC 2011»
14 years 4 months ago
Low Complexity Outage Optimal Distributed Channel Allocation for Vehicle-to-Vehicle Communications
—Due to the potential of enhancing traffic safety, protecting environment, and enabling new applications, vehicular communications, especially vehicle-to-vehicle (V2V) communica...
Bo Bai, Wei Chen, Khaled Ben Letaief, Zhigang Cao
CORR
2006
Springer
119views Education» more  CORR 2006»
14 years 9 months ago
Network Inference from Co-Occurrences
The study of networked systems is an emerging field, impacting almost every area of engineering and science, including the important domains of communication systems, biology, soc...
Michael Rabbat, Mário A. T. Figueiredo, Rob...
ICRA
2007
IEEE
119views Robotics» more  ICRA 2007»
15 years 4 months ago
Progressive Clamping
—In this paper we propose the progressive clamping method to better model the kinematic anisotropy of joint limits for virtual mannequins or robots. Like recent approaches our me...
Daniel Raunhardt, Ronan Boulic
AAAI
2011
13 years 9 months ago
Complete Information Pursuit Evasion in Polygonal Environments
Suppose an unpredictable evader is free to move around in a polygonal environment of arbitrary complexity that is under full camera surveillance. How many pursuers, each with the ...
Kyle Klein, Subhash Suri