Sciweavers

3356 search results - page 121 / 672
» Determining Consensus Numbers
Sort
View
ALGORITHMICA
2010
137views more  ALGORITHMICA 2010»
13 years 8 months ago
Deciding k-Colorability of P5-Free Graphs in Polynomial Time
The problem of computing the chromatic number of a P5-free graph (a graph which contains no path on 5 vertices as an induced subgraph) is known to be NP-hard. However, we show tha...
Chính T. Hoàng, Marcin Kaminski, Vad...
IWPC
2009
IEEE
14 years 4 months ago
A plethora of paths
A common static software bug detection technique is to use path simulation. Each execution path is simulated using symbolic variables to determine if any software errors could occ...
Eric Larson
VTC
2008
IEEE
179views Communications» more  VTC 2008»
14 years 4 months ago
Relay Subset Selection in Wireless Networks Using Partial Decode-and-Forward Transmission
This paper considers the problem of selecting a subset of nodes in a two-hop wireless network to act as relays in aiding the communication between the source-destination pair. Opt...
Caleb K. Lo, Sriram Vishwanath, Robert W. Heath Jr...
EMNETS
2007
14 years 2 months ago
An HMM framework for optimal sensor selection with applications to BSN sensor glove design
Laparoscopic surgical training is a challenging task due to the complexity of instrument control and demand on manual dexterity and hand-eye coordination. Currently, training and ...
Rachel C. King, Louis Atallah, Ara Darzi, Guang-Zh...
COLT
2006
Springer
14 years 1 months ago
A Sober Look at Clustering Stability
Stability is a common tool to verify the validity of sample based algorithms. In clustering it is widely used to tune the parameters of the algorithm, such as the number k of clust...
Shai Ben-David, Ulrike von Luxburg, Dávid P...