Sciweavers

2834 search results - page 407 / 567
» Representing Trees with Constraints
Sort
View
RSS
2007
147views Robotics» more  RSS 2007»
15 years 2 months ago
Discrete Search Leading Continuous Exploration for Kinodynamic Motion Planning
Abstract— This paper presents the Discrete Search Leading continuous eXploration (DSLX) planner, a multi-resolution approach to motion planning that is suitable for challenging p...
Erion Plaku, Lydia E. Kavraki, Moshe Y. Vardi
118
Voted
SIAMCOMP
2008
167views more  SIAMCOMP 2008»
15 years 23 days ago
Approximation Algorithms for Data Placement Problems
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...
Ivan D. Baev, Rajmohan Rajaraman, Chaitanya Swamy
110
Voted
BMCBI
2005
93views more  BMCBI 2005»
15 years 22 days ago
Multiple sequence alignment accuracy and evolutionary distance estimation
Background: Sequence alignment is a common tool in bioinformatics and comparative genomics. It is generally assumed that multiple sequence alignment yields better results than pai...
Michael S. Rosenberg
135
Voted
WINE
2010
Springer
189views Economy» more  WINE 2010»
14 years 10 months ago
Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply
We consider profit-maximization problems for combinatorial auctions with non-single minded valuation functions and limited supply. We obtain fairly general results that relate the ...
Khaled M. Elbassioni, Mahmoud Fouz, Chaitanya Swam...
126
Voted
CORR
2011
Springer
151views Education» more  CORR 2011»
14 years 7 months ago
A supervised clustering approach for fMRI-based inference of brain states
We propose a method that combines signals from many brain regions observed in functional Magnetic Resonance Imaging (fMRI) to predict the subject’s behavior during a scanning se...
Vincent Michel, Alexandre Gramfort, Gaël Varo...