Sciweavers

4112 search results - page 159 / 823
» Efficient Algorithms for the Spoonerism Problem
Sort
View
ICCAD
2007
IEEE
165views Hardware» more  ICCAD 2007»
15 years 8 months ago
BioRoute: a network-flow based routing algorithm for digital microfluidic biochips
Due to the recent advances in microfluidics, digital microfluidic biochips are expected to revolutionize laboratory procedures. One critical problem for biochip synthesis is the dr...
Ping-Hung Yuh, Chia-Lin Yang, Yao-Wen Chang
128
Voted
ASUNAM
2010
IEEE
15 years 6 months ago
Fast Discovery of Reliable Subnetworks
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
Petteri Hintsanen, Hannu Toivonen, Petteri Sevon
CORR
2010
Springer
167views Education» more  CORR 2010»
15 years 4 months ago
Network Flow Algorithms for Structured Sparsity
We consider a class of learning problems that involve a structured sparsityinducing norm defined as the sum of -norms over groups of variables. Whereas a lot of effort has been pu...
Julien Mairal, Rodolphe Jenatton, Guillaume Obozin...
144
Voted
CBMS
2006
IEEE
15 years 10 months ago
Efficient Rotation Invariant Retrieval of Shapes with Applications in Medical Databases
Recognition of shapes in images is an important problem in computer vision with application in various medical problems, including robotic surgery and cell analysis. The similarit...
Selina Chu, Shrikanth S. Narayanan, C. C. Jay Kuo
DIS
2007
Springer
15 years 8 months ago
Time and Space Efficient Discovery of Maximal Geometric Graphs
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
Hiroki Arimura, Takeaki Uno, Shinichi Shimozono