Sciweavers

5138 search results - page 920 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
TPDS
2008
136views more  TPDS 2008»
15 years 1 months ago
Data Gathering with Tunable Compression in Sensor Networks
We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a ...
Yang Yu, Bhaskar Krishnamachari, Viktor K. Prasann...
AI
2004
Springer
15 years 1 months ago
A selective sampling approach to active feature selection
Feature selection, as a preprocessing step to machine learning, has been very effective in reducing dimensionality, removing irrelevant data, increasing learning accuracy, and imp...
Huan Liu, Hiroshi Motoda, Lei Yu
JSAC
2007
139views more  JSAC 2007»
15 years 1 months ago
Reverse-Engineering MAC: A Non-Cooperative Game Model
— This paper reverse-engineers backoff-based random-access MAC protocols in ad-hoc networks. We show that the contention resolution algorithm in such protocols is implicitly part...
Jang-Won Lee, Ao Tang, Jianwei Huang, Mung Chiang,...
JSAC
2007
83views more  JSAC 2007»
15 years 1 months ago
Constructing an optimal server set in structured peer-to-peer networks
— To achieve high performance and resilience to failures, a client can make connections with multiple servers simultaneously and receive different portions of the data from each ...
Seung Chul Han, Ye Xia
AROBOTS
2002
98views more  AROBOTS 2002»
15 years 1 months ago
Dynamically-Stable Motion Planning for Humanoid Robots
We present an approach to path planning for humanoid robots that computes dynamically-stable, collision-free trajectories from full-body posture goals. Given a geometric model of t...
James J. Kuffner Jr., Satoshi Kagami, Koichi Nishi...