Sciweavers

2192 search results - page 294 / 439
» Algorithms for Challenging Motif Problems
Sort
View
TIT
2008
83views more  TIT 2008»
15 years 3 months ago
Constrained Codes as Networks of Relations
We address the well-known problem of determining the capacity of constrained coding systems. While the onedimensional case is well understood to the extent that there are technique...
Moshe Schwartz, Jehoshua Bruck
144
Voted
CORR
2011
Springer
143views Education» more  CORR 2011»
14 years 7 months ago
Towards Understanding and Harnessing the Potential of Clause Learning
Efficient implementations of DPLL with the addition of clause learning are the fastest complete Boolean satisfiability solvers and can handle many significant real-world problem...
Paul Beame, Henry A. Kautz, Ashish Sabharwal
138
Voted
SIGMOD
2011
ACM
276views Database» more  SIGMOD 2011»
14 years 6 months ago
Schedule optimization for data processing flows on the cloud
Scheduling data processing workflows (dataflows) on the cloud is a very complex and challenging task. It is essentially an optimization problem, very similar to query optimizati...
Herald Kllapi, Eva Sitaridi, Manolis M. Tsangaris,...
126
Voted
INFOCOM
2006
IEEE
15 years 9 months ago
The Internet Dark Matter - on the Missing Links in the AS Connectivity Map
Abstract— The topological structure of the Internet infrastructure is an important and interesting subject that attracted significant research attention in the last few years. A...
Rami Cohen, Danny Raz
DAC
2005
ACM
15 years 5 months ago
A combined feasibility and performance macromodel for analog circuits
The need to reuse the performance macromodels of an analog circuit topology challenges existing regression based modeling techniques. A model of good reusability should have a num...
Mengmeng Ding, Ranga Vemuri