Sciweavers

9166 search results - page 1675 / 1834
» A framework for comparing models of computation
Sort
View
ISAAC
2007
Springer
158views Algorithms» more  ISAAC 2007»
16 years 17 days ago
On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
Uffe Flarup, Pascal Koiran, Laurent Lyaudet
NETCOOP
2007
Springer
16 years 17 days ago
How Expensive Is Link Utilization?
Understanding the relationship between queueing delays and link utilization for general traffic conditions is an important open problem in networking research. Difficulties in unde...
Rade Stanojevic, Robert Shorten
DSN
2005
IEEE
16 years 1 days ago
On Partial Protection in Groomed Optical WDM Mesh Networks
In this paper, we consider the problem of survivable network design in traffic groomed optical WDM mesh networks with sub-wavelength capacity connections. In typical survivable n...
Jing Fang, Mahesh Sivakumar, Arun K. Somani, Krish...
DIGRA
2005
Springer
15 years 12 months ago
Framing Virtual Law
Building on the work of games theorists and virtual world designers, this paper proposes a framework for understanding the real-virtual dichotomy in terms of a series of five fram...
Peter Edelmann
ECCV
2004
Springer
15 years 11 months ago
Statistical Learning of Evaluation Function for ASM/AAM Image Alignment
Alignment between the input and target objects has great impact on the performance of image analysis and recognition system, such as those for medical image and face recognition. A...
Xiangsheng Huang, Stan Z. Li, Yangsheng Wang
« Prev « First page 1675 / 1834 Last » Next »