1629 search results - page 172 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
104
click to vote
ECCV
2008
Springer
16 years 17 days ago
2008
Springer
Efficient global optimization techniques such as graph cut exist for energies corresponding to binary image segmentation from lowlevel cues. However, introducing a high-level prior...
ISPD
2005
ACM
15 years 4 months ago
2005
ACM
In the nanometer VLSI technology, the variation effects like manufacturing variation, power supply noise, temperature etc. become very significant. As one of the most vital nets...
AUSAI
2003
Springer
15 years 3 months ago
2003
Springer
An important task in machine learning is determining which learning algorithm works best for a given data set. When the amount of data is small the same data needs to be used repea...
127
click to vote
MOBIHOC
2004
ACM
15 years 10 months ago
2004
ACM
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
PODS
2008
ACM
15 years 10 months ago
2008
ACM
We consider a fundamental flow maximization problem that arises during the evaluation of multiple overlapping queries defined on a data stream, in a heterogenous parallel environm...