Sciweavers

663 search results - page 110 / 133
» A Parallel Algorithm for Enumerating Combinations
Sort
View
106
Voted
IJCNN
2006
IEEE
15 years 8 months ago
Divide and Conquer Strategies for MLP Training
— Over time, neural networks have proven to be extremely powerful tools for data exploration with the capability to discover previously unknown dependencies and relationships in ...
Smriti Bhagat, Dipti Deodhare
DCOSS
2005
Springer
15 years 8 months ago
Routing Explicit Side Information for Data Compression in Wireless Sensor Networks
Abstract. Two difficulties in designing data-centric routes [2–5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computatio...
Huiyu Luo, Gregory J. Pottie
IEEEPACT
2003
IEEE
15 years 7 months ago
Picking Statistically Valid and Early Simulation Points
Modern architecture research relies heavily on detailed pipeline simulation. Simulating the full execution of an industry standard benchmark can take weeks to months to complete. ...
Erez Perelman, Greg Hamerly, Brad Calder
125
Voted
MM
2009
ACM
220views Multimedia» more  MM 2009»
15 years 7 months ago
Multi-modal scene segmentation using scene transition graphs
In this work the problem of automatic decomposition of video into elementary semantic units, known in the literature as scenes, is addressed. Two multi-modal automatic scene segme...
Panagiotis Sidiropoulos, Vasileios Mezaris, Ioanni...
CODES
2010
IEEE
15 years 12 days ago
Worst-case performance analysis of synchronous dataflow scenarios
Synchronous Dataflow (SDF) is a powerful analysis tool for regular, cyclic, parallel task graphs. The behaviour of SDF graphs however is static and therefore not always able to ac...
Marc Geilen, Sander Stuijk