Sciweavers

6413 search results - page 245 / 1283
» Classes of cycle bases
Sort
View
CVPR
2009
IEEE
17 years 1 months ago
Reducing JointBoost-Based Multiclass Classification to Proximity Search
Boosted one-versus-all (OVA) classifiers are commonly used in multiclass problems, such as generic object recognition, biometrics-based identification, or gesture recognition. Join...
Alexandra Stefan (University of Texas at Arlington...
ICS
2005
Tsinghua U.
16 years 5 days ago
What is worth learning from parallel workloads?: a user and session based analysis
Learning useful and predictable features from past workloads and exploiting them well is a major source of improvement in many operating system problems. We review known parallel ...
Julia Zilber, Ofer Amit, David Talby
SPAA
2004
ACM
16 years 2 days ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
LPAR
2004
Springer
16 years 23 hour ago
Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
Dietmar Berwanger, Erich Grädel
173
Voted
CORR
2007
Springer
95views Education» more  CORR 2007»
15 years 6 months ago
Scheduling in Data Intensive and Network Aware (DIANA) Grid Environments
In Grids scheduling decisions are often made on the basis of jobs being either data or computation intensive: in data intensive situations jobs may be pushed to the data and in co...
Richard McClatchey, Ashiq Anjum, Heinz Stockinger,...