Sciweavers

537 search results - page 33 / 108
» A Call to Regularity
Sort
View
BDA
2006
13 years 9 months ago
Capturing well typed references in DTDs
Surprisingly enough, there has been few investigations for typing references of semistructured data and XML documents. This paper build on a previous proposal [7] introducing simp...
Nicole Bidoit, Dario Colazzo
JMLR
2006
148views more  JMLR 2006»
13 years 7 months ago
Computational and Theoretical Analysis of Null Space and Orthogonal Linear Discriminant Analysis
Dimensionality reduction is an important pre-processing step in many applications. Linear discriminant analysis (LDA) is a classical statistical approach for supervised dimensiona...
Jieping Ye, Tao Xiong
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
14 years 16 days ago
Complexity Theory for Operators in Analysis
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
Akitoshi Kawamura and Stephen Cook
GLOBECOM
2009
IEEE
14 years 2 months ago
Hole Reshaping Routing in Large-Scale Mobile Ad-Hoc Networks
—Mobile ad-hoc networks (MANETs) usually contain sparse or even empty regions called holes. The local optimum problem will occur when routing packets meet holes in the network. I...
Peiqiang Li, Guojun Wang, Jie Wu, Hong-Chuan Yang
ECOOP
2005
Springer
14 years 1 months ago
Loosely-Separated "Sister" Namespaces in Java
Most modern programming systems such as Java allow us to link independently developed components together dynamically. This makes it possible to develop and deploy software on a pe...
Yoshiki Sato, Shigeru Chiba