Sciweavers

239 search results - page 42 / 48
» Some Results on Greedy Embeddings in Metric Spaces
Sort
View
CORR
2007
Springer
126views Education» more  CORR 2007»
14 years 9 months ago
Dial a Ride from k-forest
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath ...
DATE
2009
IEEE
140views Hardware» more  DATE 2009»
15 years 4 months ago
Lifetime reliability-aware task allocation and scheduling for MPSoC platforms
With the relentless scaling of semiconductor technology, the lifetime reliability of embedded multiprocessor platforms has become one of the major concerns for the industry. If th...
Lin Huang, Feng Yuan, Qiang Xu
ECRTS
2007
IEEE
15 years 3 months ago
Predictable Paging in Real-Time Systems: A Compiler Approach
Conventionally, the use of virtual memory in real-time systems has been avoided, the main reason being the difficulties it provides to timing analysis. However, there is a trend ...
Isabelle Puaut, Damien Hardy
ICDM
2005
IEEE
165views Data Mining» more  ICDM 2005»
15 years 3 months ago
Orthogonal Neighborhood Preserving Projections
— Orthogonal Neighborhood Preserving Projections (ONPP) is a linear dimensionality reduction technique which attempts to preserve both the intrinsic neighborhood geometry of the ...
Effrosini Kokiopoulou, Yousef Saad
HICSS
2003
IEEE
109views Biometrics» more  HICSS 2003»
15 years 2 months ago
Towards a Structurational Theory of Information Systems: A Substantive Case Analysis
This paper employs the analysis of an interpretive case study within a Regional Train Operating Company (RTOC) to arrive at theoretical understandings of Information Systems (IS)....
Jeremy Rose, Ray Hackney