Sciweavers

998 search results - page 83 / 200
» From Feasible Proofs to Feasible Computations
Sort
View
ICASSP
2011
IEEE
13 years 18 days ago
Rank-deficient quadratic-form maximization over M-phase alphabet: Polynomial-complexity solvability and algorithmic developments
The maximization of a positive (semi)definite complex quadratic form over a finite alphabet is NP-hard and achieved through exhaustive search when the form has full rank. Howeve...
Anastasios T. Kyrillidis, George N. Karystinos
CRV
2011
IEEE
309views Robotics» more  CRV 2011»
12 years 8 months ago
Optimal Alignment of 3D Data for Spatial Discretization
—We present an algorithm that finds the rotation which best aligns a given configuration of directions on an unsorted set of directions. Using a cost function that we derive in...
Benjamin Huhle, Timo Schairer, Andreas Schilling, ...
BMCBI
2010
74views more  BMCBI 2010»
13 years 9 months ago
Correcting for the effects of natural abundance in stable isotope resolved metabolomics experiments involving ultra-high resolut
Background: Stable isotope tracing with ultra-high resolution Fourier transform-ion cyclotron resonance-mass spectrometry (FT-ICR-MS) can provide simultaneous determination of hun...
Hunter N. B. Moseley
CG
1999
Springer
13 years 8 months ago
There is more to context than location
Context is a key issue in interaction between human and computer, describing the surrounding facts that add meaning. In mobile computing research published the parameter location ...
Albrecht Schmidt, Michael Beigl, Hans-Werner Gelle...
INFOCOM
2010
IEEE
13 years 7 months ago
Limitations and Possibilities of Path Trading between Autonomous Systems
Abstract—When forwarding packets in the Internet, Autonomous Systems (ASes) frequently choose the shortest path in their network to the next-hop AS in the BGP path, a strategy kn...
Yuval Shavitt, Yaron Singer