Sciweavers

4137 search results - page 86 / 828
» On the number of matchings of a tree
Sort
View
ICDE
2006
IEEE
143views Database» more  ICDE 2006»
15 years 8 months ago
Application-aware Overlay Networks for Data Dissemination
XPORT (eXtensible Profile-driven Overlay Routing Trees) is a generic data dissemination system that supports an extensible set of data types and profiles, and an optimization fr...
Olga Papaemmanouil, Yanif Ahmad, Ugur Çetin...
WCRE
2003
IEEE
15 years 7 months ago
RegReg: a Lightweight Generator of Robust Parsers for Irregular Languages
In reverse engineering, parsing may be partially done to extract lightweight source models. Parsing code containing preprocessing directives, syntactical errors and embedded langu...
Mario Latendresse
CDC
2009
IEEE
189views Control Systems» more  CDC 2009»
15 years 6 months ago
Maximizing aggregated revenue in sensor networks under deadline constraints
Abstract— We study the problem of maximizing the aggregated revenue in sensor networks with deadline constraints. Our model is that of a sensor network that is arranged in the fo...
Srikanth Hariharan, Ness B. Shroff
COMPGEOM
1996
ACM
15 years 6 months ago
New Lower Bounds for Convex Hull Problems in Odd Dimensions
We show that in the worst case, (ndd=2e;1 +n logn) sidedness queries are required to determine whether the convex hull of n points in IRd is simplicial, or to determine the number ...
Jeff Erickson
CASES
2007
ACM
15 years 6 months ago
Compiler generation from structural architecture descriptions
With increasing complexity of modern embedded systems, the availability of highly optimizing compilers becomes more and more important. At the same time, application specific inst...
Florian Brandner, Dietmar Ebner, Andreas Krall