Sciweavers

42230 search results - page 397 / 8446
» Algorithms and Complexity Results for
Sort
View
IJBRA
2007
88views more  IJBRA 2007»
15 years 6 months ago
Finding molecular complexes through multiple layer clustering of protein interaction networks
: Clustering protein-protein interaction networks (PINs) helps to identify complexes that guide the cell machinery. Clustering algorithms often create a flat clustering, without co...
Bill Andreopoulos, Aijun An, Xiangji Huang, Xiaoga...
IROS
2008
IEEE
142views Robotics» more  IROS 2008»
16 years 1 months ago
Apprenticeship learning for motion planning with application to parking lot navigation
— Motion and path-planning algorithms often use complex cost functions for both global navigation and local smoothing of trajectories. Obtaining good results typically requires c...
Pieter Abbeel, Dmitri Dolgov, Andrew Y. Ng, Sebast...
TWC
2008
109views more  TWC 2008»
15 years 6 months ago
On Multiple Symbol Detection for Diagonal DUSTM Over Ricean Channels
This letter considers multiple symbol differential detection for multiple-antenna systems over flat Ricean-fading channels when partial channel state information (CSI) is available...
Tao Cui, Chintha Tellambura
JSAC
1998
81views more  JSAC 1998»
15 years 6 months ago
Early Detection and Trellis Splicing: Reduced-Complexity Iterative Decoding
Abstract—The excellent bit error rate performance of new iterative decoding algorithms (e.g., turbodecoding) is achieved at the expense of a computationally burdensome decoding p...
Brendan J. Frey, Frank R. Kschischang
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
16 years 7 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang