Sciweavers

976 search results - page 70 / 196
» The Complexity of Timetable Construction Problems
Sort
View
ECCV
2006
Springer
14 years 11 months ago
Riemannian Manifold Learning for Nonlinear Dimensionality Reduction
In recent years, nonlinear dimensionality reduction (NLDR) techniques have attracted much attention in visual perception and many other areas of science. We propose an efficient al...
Tony Lin, Hongbin Zha, Sang Uk Lee
STOC
2003
ACM
96views Algorithms» more  STOC 2003»
14 years 9 months ago
Optimal oblivious routing in polynomial time
A recent seminal result of R?acke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, R?ack...
Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, H...
CIBSE
2009
ACM
14 years 3 months ago
A Domain Specific Language to Generate Web Applications
Nowadays building a web application is still a complex process that requires a big effort to get several tasks done. This article presents a domain specific language aimed to simpl...
Juan José Cadavid, Juan Bernardo Quintero, ...
ISQED
2007
IEEE
254views Hardware» more  ISQED 2007»
14 years 3 months ago
An Aggregation-Based Algebraic Multigrid Method for Power Grid Analysis
ct This paper develops an aggregation-based algebraic multigrid (AbAMG) method to efficiently analyze the power grids. Different from the conventional algebraic multigrid (AMG) sc...
Pei-Yu Huang, Huan-Yu Chou, Yu-Min Lee
CCECE
2006
IEEE
14 years 3 months ago
New Constraints on Generation of Uniform Random Samples from Evolutionary Trees
In this paper, we introduce new algorithms for selecting taxon samples from large evolutionary trees, maintaining uniformity and randomness, under certain new constraints on the t...
Anupam Bhattacharjee, Zalia Shams, Kazi Zakia Sult...