Sciweavers

2969 search results - page 39 / 594
» A space efficient algorithm for group structure computation
Sort
View
CSDA
2008
65views more  CSDA 2008»
15 years 3 months ago
Improving updating rules in multiplicative algorithms for computing D-optimal designs
In this paper we discuss a class of multiplicative algorithms for computing D-optimal designs for regression models on a finite design space. We prove a monotonicity result for a ...
Holger Dette, Andrey Pepelyshev, Anatoly A. Zhiglj...
IPPS
2005
IEEE
15 years 8 months ago
Using Leader-Based Communication to Improve the Scalability of Single-Round Group Membership Algorithms
Sigma, the first single-round group membership (GM) algorithm, was recently introduced and demonstrated to operate consistently with theoretical expectations in a simulated WAN en...
Roger Khazan, Sophia Yuditskaya
STOC
2003
ACM
133views Algorithms» more  STOC 2003»
16 years 3 months ago
A fast algorithm for computing steiner edge connectivity
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
Richard Cole, Ramesh Hariharan
ICDE
2008
IEEE
336views Database» more  ICDE 2008»
16 years 4 months ago
Dominant Graph: An Efficient Indexing Structure to Answer Top-K Queries
Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest. In this paper, we investi...
Lei Zou, Lei Chen 0002
CVPR
2009
IEEE
16 years 10 months ago
Efficient Scale Space Auto-Context for Image Segmentation and Labeling
The Conditional Random Fields (CRF) model, using patch-based classification bound with context information, has recently been widely adopted for image segmentation/ labeling. In...
Jiayan Jiang (UCLA), Zhuowen Tu (UCLA)