Sciweavers

2397 search results - page 75 / 480
» Applications of integer relation algorithms
Sort
View
ICDM
2010
IEEE
135views Data Mining» more  ICDM 2010»
14 years 10 months ago
Learning a Bi-Stochastic Data Similarity Matrix
An idealized clustering algorithm seeks to learn a cluster-adjacency matrix such that, if two data points belong to the same cluster, the corresponding entry would be 1; otherwise ...
Fei Wang, Ping Li, Arnd Christian König
AAAI
2000
15 years 1 months ago
Decision Making under Uncertainty: Operations Research Meets AI (Again)
Models for sequential decision making under uncertainty (e.g., Markov decision processes,or MDPs) have beenstudied in operations research for decades. The recent incorporation of ...
Craig Boutilier
ICCAD
2009
IEEE
131views Hardware» more  ICCAD 2009»
14 years 9 months ago
Scheduling with soft constraints
In a behavioral synthesis system, a typical approach used to guide the scheduler is to impose hard constraints on the relative timing between operations considering performance, a...
Jason Cong, Bin Liu, Zhiru Zhang
ICPADS
2005
IEEE
15 years 5 months ago
Minimizing Energy via Loop Scheduling and DVS for Multi-Core Embedded Systems
Low energy consumptions are extremely important in real-time embedded systems, and scheduling is one of the techniques used to obtain lower energy consumptions. In this paper, we ...
Ying Chen, Zili Shao, Qingfeng Zhuge, Chun Xue, Bi...
STOC
2009
ACM
144views Algorithms» more  STOC 2009»
16 years 15 days ago
Homology flows, cohomology cuts
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
Erin W. Chambers, Jeff Erickson, Amir Nayyeri