Sciweavers

8278 search results - page 1419 / 1656
» Context-Aware Process Networks
Sort
View
GECCO
2009
Springer
143views Optimization» more  GECCO 2009»
15 years 11 months ago
Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
Martin Gruber, Günther R. Raidl
IFIP
2009
Springer
15 years 11 months ago
A Pipelined IP Address Lookup Module for 100 Gbps Line Rates and beyond
New Internet services and technologies call for higher packet switching capacities in the core network. Thus, a performance bottleneck arises at the backbone routers, as forwarding...
Domenic Teuchert, Simon Hauger
NOSSDAV
2009
Springer
15 years 11 months ago
SLIPstream: scalable low-latency interactive perception on streaming data
A critical problem in implementing interactive perception applications is the considerable computational cost of current computer vision and machine learning algorithms, which typ...
Padmanabhan Pillai, Lily B. Mummert, Steven W. Sch...
NOSSDAV
2009
Springer
15 years 11 months ago
Power efficient real-time disk scheduling
Hard-disk drive power consumption reduction methods focus mainly on increasing the amount of time the disk is in standby mode (disk spun down) by implementing aggressive data read...
Damien Le Moal, Donald Molaro, Jorge Campello
PKDD
2009
Springer
174views Data Mining» more  PKDD 2009»
15 years 11 months ago
Active and Semi-supervised Data Domain Description
Data domain description techniques aim at deriving concise descriptions of objects belonging to a category of interest. For instance, the support vector domain description (SVDD) l...
Nico Görnitz, Marius Kloft, Ulf Brefeld
« Prev « First page 1419 / 1656 Last » Next »