Sciweavers

466 search results - page 46 / 94
» Fundamental Complexity of Optical Systems
Sort
View
INFOCOM
2006
IEEE
14 years 3 months ago
Stable Scheduling Policies for Maximizing Throughput in Generalized Constrained Queueing Systems
We consider a class of queueing networks referred to as “generalized constrained queueing networks” which form the basis of several different communication networks and inform...
Prasanna Chaporkar, Saswati Sarkar
SDM
2003
SIAM
123views Data Mining» more  SDM 2003»
13 years 10 months ago
Fast Online SVD Revisions for Lightweight Recommender Systems
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
Matthew Brand
FGCS
2000
101views more  FGCS 2000»
13 years 9 months ago
VRML as means of expressive 4D illustration in CAM education
Computer graphics (CGr) lies in the fundaments of computer aided engineering (CAE). As a result from the fast development in both CGr and CAE, more and more computer aided systems...
Nikolay Avgoustinov
CSL
2007
Springer
14 years 3 months ago
The Theory of Calculi with Explicit Substitutions Revisited
Calculi with explicit substitutions (ES) are widely used in different areas of computer science. Complex systems with ES were developed these last 15 years to capture the good comp...
Delia Kesner
ECBS
2006
IEEE
90views Hardware» more  ECBS 2006»
14 years 3 months ago
Evaluating Alternatives for Architecture-Oriented Refactoring
Refactoring of software systems represents an fundamental way of improving their quality properties. Large-scale refactoring has to be performed at an architectural level to execu...
Sven Wohlfarth, Matthias Riebisch