Sciweavers

3265 search results - page 126 / 653
» Representing Groups on Graphs
Sort
View
COMSUR
2011
219views Hardware» more  COMSUR 2011»
14 years 3 months ago
Link Scheduling Algorithms for Wireless Mesh Networks
Abstract—We provide an overview of link scheduling algorithms in Spatial Time Division Access (STDMA) wireless mesh networks. These algorithms can be classified into three categ...
Ashutosh Deepak Gore, Abhay Karandikar
DAWAK
2011
Springer
14 years 3 months ago
Support for User Involvement in Data Cleaning
Data cleaning and ETL processes are usually modeled as graphs of data transformations. The involvement of the users responsible for executing these graphs over real data is importa...
Helena Galhardas, Antónia Lopes, Emanuel Sa...
DM
2006
99views more  DM 2006»
15 years 4 months ago
Bias matroids with unique graphical representations
Given a 3-connected biased graph with three node-disjoint unbalanced circles, at most one of which is a loop, we describe how the bias matroid of is uniquely represented by .
Daniel C. Slilaty
131
Voted
CVPR
2008
IEEE
16 years 6 months ago
From skeletons to bone graphs: Medial abstraction for object recognition
letons to Bone Graphs: Medial Abstraction for Object Recognition Diego Macrini University of Toronto Kaleem Siddiqi McGill University Sven Dickinson University of Toronto Medial d...
Diego Macrini, Kaleem Siddiqi, Sven J. Dickinson
ICPP
1999
IEEE
15 years 8 months ago
SLC: Symbolic Scheduling for Executing Parameterized Task Graphs on Multiprocessors
Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for...
Michel Cosnard, Emmanuel Jeannot, Tao Yang