Sciweavers

14078 search results - page 2131 / 2816
» Design and Analysis of Computer Algorithms
Sort
View
215
Voted
ICCAD
1994
IEEE
117views Hardware» more  ICCAD 1994»
15 years 11 months ago
Optimization of critical paths in circuits with level-sensitive latches
A simple extension of the critical path method is presented which allows more accurate optimization of circuits with level-sensitive latches. The extended formulation provides a s...
Timothy M. Burks, Karem A. Sakallah
212
Voted
FSS
2010
147views more  FSS 2010»
15 years 5 months ago
A divide and conquer method for learning large Fuzzy Cognitive Maps
Fuzzy Cognitive Maps (FCMs) are a convenient tool for modeling and simulating dynamic systems. FCMs were applied in a large number of diverse areas and have already gained momentu...
Wojciech Stach, Lukasz A. Kurgan, Witold Pedrycz
188
Voted
KDD
2004
ACM
108views Data Mining» more  KDD 2004»
16 years 7 months ago
Sleeved coclustering
A coCluster of a m?n matrix X is a submatrix determined by a subset of the rows and a subset of the columns. The problem of finding coClusters with specific properties is of inter...
Avraham A. Melkman, Eran Shaham
323
Voted
SIGMOD
2008
ACM
162views Database» more  SIGMOD 2008»
16 years 7 months ago
Event queries on correlated probabilistic streams
A major problem in detecting events in streams of data is that the data can be imprecise (e.g. RFID data). However, current state-ofthe-art event detection systems such as Cayuga ...
Christopher Ré, Dan Suciu, Julie Letchner, ...
205
Voted
SYNASC
2006
IEEE
103views Algorithms» more  SYNASC 2006»
16 years 1 months ago
Incremental Deterministic Planning
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
Stefan Andrei, Wei-Ngan Chin, Martin C. Rinard
« Prev « First page 2131 / 2816 Last » Next »