Sciweavers

13603 search results - page 2432 / 2721
» On the computational complexity of bridgecard
Sort
View
176
Voted
CGF
2004
86views more  CGF 2004»
15 years 6 months ago
Procedural Texture Matching and Transformation
We present a technique for creating a smoothly varying sequence of procedural textures that interpolates between arbitrary input samples of texture. This texture transformation us...
Eric Bourque, Gregory Dudek
211
Voted
CLUSTER
2004
IEEE
15 years 6 months ago
Resource Management for Ad-Hoc Wireless Networks with Cluster Organization
Boosted by technology advancements, government and commercial interest, ad-hoc wireless networks are emerging as a serious platform for distributed mission-critical applications. G...
Ionut Cardei, Srivatsan Varadarajan, Allalaghatta ...
191
Voted
JSA
2000
115views more  JSA 2000»
15 years 6 months ago
Scheduling optimization through iterative refinement
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...
Mayez A. Al-Mouhamed, Adel Al-Massarani
174
Voted
CGF
2008
151views more  CGF 2008»
15 years 6 months ago
Navigation and Exploration of Interconnected Pathways
Visualizing pathways, i. e. models of cellular functional networks, is a challenging task in computer assisted biomedicine. Pathways are represented as large collections of interw...
Marc Streit, Michael Kalkusch, Karl Kashofer, Diet...
193
Voted
PVLDB
2008
100views more  PVLDB 2008»
15 years 6 months ago
Efficiently approximating query optimizer plan diagrams
Given a parametrized n-dimensional SQL query template and a choice of query optimizer, a plan diagram is a color-coded pictorial enumeration of the execution plan choices of the o...
Atreyee Dey, Sourjya Bhaumik, Harish D., Jayant R....
« Prev « First page 2432 / 2721 Last » Next »