Sciweavers

957 search results - page 149 / 192
» Addition Chain Heuristics
Sort
View
INFOCOM
2010
IEEE
13 years 8 months ago
Worst-Case TCAM Rule Expansion
—Designers of TCAMs (ternary CAMs) for packet classification often have to deal with unpredictable sets of rules. These result in highly variable rule expansions, and can only r...
Ori Rottenstreich, Isaac Keslassy
JCO
2010
101views more  JCO 2010»
13 years 8 months ago
Separator-based data reduction for signed graph balancing
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier
VTC
2010
IEEE
173views Communications» more  VTC 2010»
13 years 8 months ago
Streetcast: An Urban Broadcast Protocol for Vehicular Ad-Hoc Networks
—Vehicular Ad-hoc NETworks (VANETs) adopting Dedicated Short-Range Communications (DSRCs) have emerged as a preferred choice of network design for the Intelligent Transportation ...
Chih-Wei Yi, Yi-Ta Chuang, Hou-Heng Yeh, Yu-Chee T...
ICDM
2010
IEEE
193views Data Mining» more  ICDM 2010»
13 years 8 months ago
Supervised Link Prediction Using Multiple Sources
Link prediction is a fundamental problem in social network analysis and modern-day commercial applications such as Facebook and Myspace. Most existing research approaches this pro...
Zhengdong Lu, Berkant Savas, Wei Tang, Inderjit S....
ICIP
2010
IEEE
13 years 8 months ago
Reducing graphs in graph cut segmentation
In few years, graph cuts have become a leading method for solving a wide range of problems in computer vision. However, graph cuts involve the construction of huge graphs which so...
Nicolas Lerme, François Malgouyres, Lucas L...