Sciweavers

4137 search results - page 462 / 828
» On the number of matchings of a tree
Sort
View
3DPVT
2002
IEEE
193views Visualization» more  3DPVT 2002»
15 years 12 months ago
Modeling shapes and textures from images: new frontiers
Increasingly, models of the world are directly built from images. The paper discusses a number of recent developments that try to push the enveloppe of what image-based modeling c...
Luc J. Van Gool, D. Vandemeulen, Gregor A. Kalbere...
FOCS
2000
IEEE
15 years 11 months ago
Cache-Oblivious B-Trees
We present dynamic search-tree data structures that perform well in the setting of a hierarchical memory (including various levels of cache, disk, etc.), but do not depend on the ...
Michael A. Bender, Erik D. Demaine, Martin Farach-...
ICNP
2009
IEEE
16 years 1 months ago
oCast: Optimal Multicast Routing Protocol for Wireless Sensor Networks
—In this paper, we describe oCast, an energy-optimal multicast routing protocol for wireless sensor networks. The general minimum-energy multicast problem is NP-hard. Intermitten...
Lu Su, Bolin Ding, Yong Yang, Tarek F. Abdelzaher,...
IWPEC
2009
Springer
16 years 1 months ago
Boolean-Width of Graphs
Abstract. We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. For many graph problems this number is...
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshel...
INFOCOM
2007
IEEE
16 years 1 months ago
Distributed Low-Complexity Maximum-Throughput Scheduling for Wireless Backhaul Networks
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...
Abdul Kader Kabbani, Theodoros Salonidis, Edward W...