Sciweavers

2283 search results - page 321 / 457
» Bounds of Graph Characteristics
Sort
View
HCI
2009
13 years 5 months ago
Using Activity Descriptions to Generate User Interfaces for ERP Software
Delivering tailor-made ERP software requires automation of screen and printed report creation to be cost effective. Screens generated directly from data structures tend to have poo...
Timothy O'Hear, Yassin Boudjenane
IPMI
2011
Springer
12 years 11 months ago
Learning an Atlas of a Cognitive Process in Its Functional Geometry
In this paper we construct an atlas that captures functional characteristics of a cognitive process from a population of individuals. The functional connectivity is encoded in a lo...
Georg Langs, Danial Lashkari, Andrew Sweet, Yanmei...
IPMI
2005
Springer
14 years 1 months ago
Fundamental Limits in 3D Landmark Localization
This work analyses the accuracy of estimating the location of 3D landmarks and characteristic image structures. Based on nonlinear estimation theory we study the minimal stochastic...
Karl Rohr
ICALP
2011
Springer
12 years 11 months ago
Improved Approximation for the Directed Spanner Problem
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
Piotr Berman, Arnab Bhattacharyya, Konstantin Maka...
PLDI
2004
ACM
14 years 1 months ago
Balancing register allocation across threads for a multithreaded network processor
+ Modern network processors employ multi-threading to allow concurrency amongst multiple packet processing tasks. We studied the properties of applications running on the network p...
Xiaotong Zhuang, Santosh Pande