Sciweavers

664 search results - page 48 / 133
» Solution to the Counterfeit Coin Problem and its Generalizat...
Sort
View
ALMOB
2006
110views more  ALMOB 2006»
14 years 10 months ago
Computing distribution of scale independent motifs in biological sequences
The use of Chaos Game Representation (CGR) or its generalization, Universal Sequence Maps (USM), to describe the distribution of biological sequences has been found objectionable ...
Jonas S. Almeida, Susana Vinga
CCCG
1994
14 years 11 months ago
Widest Empty Corridor with Multiple Links and Right-angle Turns
We formulate the problem of computing the widest empty corridor with at most ` links and right-angle turns for a set of n points. It is a generalization of the widest empty corrid...
Siu-Wing Cheng
AUTOMATICA
2008
89views more  AUTOMATICA 2008»
14 years 10 months ago
Dynamic buffer management using optimal control of hybrid systems
This paper studies a general dynamic buffer management problem with one buffer inserted between two interacting components. The component to be controlled is assumed to have multi...
Wei Zhang, Jianghai Hu
CORR
2010
Springer
167views Education» more  CORR 2010»
14 years 10 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...
ML
2007
ACM
101views Machine Learning» more  ML 2007»
14 years 9 months ago
A persistent union-find data structure
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...
Sylvain Conchon, Jean-Christophe Filliâtre