Sciweavers

183 search results - page 36 / 37
» Complete Minors and Independence Number
Sort
View
ISCA
2002
IEEE
174views Hardware» more  ISCA 2002»
13 years 5 months ago
Efficient Task Partitioning Algorithms for Distributed Shared Memory Systems
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
Sibabrata Ray, Hong Jiang
INFOCOM
2010
IEEE
13 years 4 months ago
BitTorrent Darknets
Abstract—A private BitTorrent site (also known as a “BitTorrent darknet”) is a collection of torrents that can only be accessed by members of the darknet community. The priva...
Chao Zhang, Prithula Dhungel, Di Wu, Zhengye Liu, ...
TVCG
2010
188views more  TVCG 2010»
13 years 4 months ago
Analyzing and Tracking Burning Structures in Lean Premixed Hydrogen Flames
— This paper presents topology-based methods to robustly extract, analyze, and track features defined as subsets of isosurfaces. First, we demonstrate how features identified b...
Peer-Timo Bremer, Gunther H. Weber, Valerio Pascuc...

Publication
254views
12 years 11 months ago
Z-fighting aware Depth Peeling
Efficient capturing of the entire topological and geometric information of a 3D scene is an important feature in many graphics applications for rendering multi-fragment effects. Ex...
Andreas Vasilakis and Ioannis Fudos
APPROX
2011
Springer
242views Algorithms» more  APPROX 2011»
12 years 5 months ago
New Tools for Graph Coloring
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
Sanjeev Arora, Rong Ge