Sciweavers

14084 search results - page 2786 / 2817
» A Theory for Game Theories
Sort
View
DAM
2011
13 years 2 months ago
On minimal Sturmian partial words
Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A = A ∪ { }, where stands for a hol...
Francine Blanchet-Sadri, John Lensmire
ICONFERENCE
2011
13 years 2 months ago
Blogs: spinning a web of virality
The aim of this study is to understand the role of bloggers in driving viral information. More specifically, we develop a new methodology that creates a map of the „life cycle...
Karine Nahon, Jeff Hemsley, Shawn Walker, Muzammil...
CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 2 months ago
Complexity of Data Dependence problems for Program Schemas with Concurrency
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
Sebastian Danicic, Robert M. Hierons, Michael R. L...
CORR
2010
Springer
139views Education» more  CORR 2010»
13 years 2 months ago
Data Cleaning and Query Answering with Matching Dependencies and Matching Functions
Matching dependencies were recently introduced as declarative rules for data cleaning and entity resolution. Enforcing a matching dependency on a database instance identifies the ...
Leopoldo E. Bertossi, Solmaz Kolahi, Laks V. S. La...
JCO
2011
115views more  JCO 2011»
13 years 2 months ago
Approximation scheme for restricted discrete gate sizing targeting delay minimization
Discrete gate sizing is a critical optimization in VLSI circuit design. Given a set of available gate sizes, discrete gate sizing problem asks to assign a size to each gate such th...
Chen Liao, Shiyan Hu
« Prev « First page 2786 / 2817 Last » Next »