Sciweavers

3663 search results - page 707 / 733
» Problems in the ontology of computer programs
Sort
View
85
Voted
SPAA
2009
ACM
15 years 6 months ago
A randomized, o(log w)-depth 2 smoothing network
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
Marios Mavronicolas, Thomas Sauerwald
CVPR
2010
IEEE
15 years 5 months ago
Naming People from Dialog: Temporal Grouping and Weak Supervision
We address the character identification problem in movies and television videos: assigning names to faces on the screen. Most prior work on person recognition in video assumes s...
Timothee Cour, Benjamin Sapp, Akash Nagle, Ben Tas...
HYBRID
2010
Springer
15 years 4 months ago
Automatic invariant generation for hybrid systems using ideal fixed points
We present computational techniques for automatically generating algebraic (polynomial equality) invariants for algebraic hybrid systems. Such systems involve ordinary differentia...
Sriram Sankaranarayanan
DAC
2009
ACM
15 years 4 months ago
Clock skew optimization via wiresizing for timing sign-off covering all process corners
Manufacturing process variability impacts the performance of synchronous logic circuits by means of its effect on both clock network and functional block delays. Typically, varia...
Sari Onaissi, Khaled R. Heloue, Farid N. Najm
RECOMB
2009
Springer
15 years 4 months ago
Protein Fragment Swapping: A Method for Asymmetric, Selective Site-Directed Recombination
This paper presents a new approach to site-directed recombination, swapping combinations of selected discontiguous fragments from a source protein in place of corresponding fragmen...
Wei Zheng, Karl E. Griswold, Chris Bailey-Kellogg