Sciweavers

2612 search results - page 81 / 523
» Switching Graphs and Their Complexity
Sort
View
ICC
2000
IEEE
109views Communications» more  ICC 2000»
14 years 2 months ago
Traffic Engineering Algorithms Using MPLS for Service Differentiation
This paper proposes an approach to Traffic Engineering that uses Differentiated Services (diffserv) and Multi-Protocol Label Switching (MPLS) to provide quantitative QoS guarantees...
Richard Rabbat, Kenneth P. Laberteaux, Nirav Modi,...
SSDBM
2009
IEEE
174views Database» more  SSDBM 2009»
14 years 4 months ago
Optimization and Execution of Complex Scientific Queries over Uncorrelated Experimental Data
Scientific experiments produce large volumes of data represented as complex objects that describe independent events such as particle collisions. Scientific analyses can be express...
Ruslan Fomkin, Tore Risch
SI3D
2003
ACM
14 years 3 months ago
Interactive visibility culling in complex environments using occlusion-switches
: We present occlusion-switches for interactive visibility culling in complex 3D environments. An occlusionswitch consists of two GPUs (graphics processing units) and each GPU is u...
Naga K. Govindaraju, Avneesh Sud, Sung-Eui Yoon, D...
ADC
2008
Springer
110views Database» more  ADC 2008»
14 years 4 months ago
Graph Mining based on a Data Partitioning Approach
Existing graph mining algorithms typically assume that the dataset can fit into main memory. As many large graph datasets cannot satisfy this condition, truly scalable graph minin...
Son N. Nguyen, Maria E. Orlowska, Xue Li
CINQ
2004
Springer
182views Database» more  CINQ 2004»
14 years 1 months ago
Mining Constrained Graphs: The Case of Workflow Systems
Abstract. Constrained graphs are directed graphs describing the control flow of processes models. In such graphs, nodes represent activities involved in the process, and edges the ...
Gianluigi Greco, Antonella Guzzo, Giuseppe Manco, ...