Sciweavers

3946 search results - page 549 / 790
» The computational complexity of choice sets
Sort
View
RECOMB
2009
Springer
16 years 7 months ago
Simultaneous Alignment and Folding of Protein Sequences
Abstract. Accurate comparative analysis tools for low-homology proteins remains a difficult challenge in computational biology, especially sequence alignment and consensus folding ...
Bonnie Berger, Charles W. O'Donnell, Jér&oc...
PODC
2009
ACM
16 years 7 months ago
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...
Riko Jacob, Andréa W. Richa, Christian Sche...
CHI
2007
ACM
16 years 7 months ago
Sharing a single expert among multiple partners
Expertise to assist people on complex tasks is often in short supply. One solution to this problem is to design systems that allow remote experts to help multiple people in simult...
Jeffrey Wong, Lui Min Oh, Jiazhi Ou, Carolyn Penst...
VLSID
2005
IEEE
157views VLSI» more  VLSID 2005»
16 years 7 months ago
Energy Efficient Hardware Synthesis of Polynomial Expressions
Polynomial expressions are used to approximate a wide variety of functions commonly found in signal processing and computer graphics applications. Computing these polynomial expre...
Anup Hosangadi, Farzan Fallah, Ryan Kastner
STOC
2002
ACM
99views Algorithms» more  STOC 2002»
16 years 7 months ago
Recognizing string graphs in NP
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curv...
Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic