Sciweavers

684 search results - page 86 / 137
» A characterization of b-perfect graphs
Sort
View
ISPASS
2009
IEEE
15 years 6 months ago
Lonestar: A suite of parallel irregular programs
Until recently, parallel programming has largely focused on the exploitation of data-parallelism in dense matrix programs. However, many important application domains, including m...
Milind Kulkarni, Martin Burtscher, Calin Cascaval,...
INFOCOM
2007
IEEE
15 years 6 months ago
Modelling and Optimization of Stochastic Routing for Wireless Multi-Hop Networks
—We introduce a novel approach to multi-hop routing in wireless networks. Instead of the usual graph description we characterize the network by the packet delivery ratio matrix w...
Alejandro Ribeiro, Georgios B. Giannakis, Zhi-Quan...
ICDCSW
2005
IEEE
15 years 5 months ago
Parallel Bindings in Distributed Multimedia Systems
Today’s multimedia environments are characterized by different stationary and a growing number of mobile devices, like PDAs or even mobile phones. To meet their requirements reg...
Michael Repplinger, Florian Winter, Marco Lohse, P...
EMMCVPR
2001
Springer
15 years 4 months ago
Grouping with Directed Relationships
Abstract. Grouping is a global partitioning process that integrates local cues distributed over the entire image. We identify four types of pairwise relationships, attraction and r...
Stella X. Yu, Jianbo Shi
STACS
1994
Springer
15 years 3 months ago
Reachability and the Power of Local Ordering
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
Kousha Etessami, Neil Immerman