Sciweavers

327 search results - page 60 / 66
» Some Elimination Problems for Matrices
Sort
View
JISE
2007
116views more  JISE 2007»
13 years 9 months ago
Mining Navigation Behaviors for Term Suggestion of Search Engines
Query expansion is extensively applied in information retrieval systems, such as search engines. Most conventional approaches to query expansion have been developed based on textua...
Hahn-Ming Lee, Chi-Chun Huang, Wei-Tang Hung
TASE
2010
IEEE
13 years 4 months ago
Robust Calibration for Localization in Clustered Wireless Sensor Networks
This paper presents a robust calibration procedure for clustered wireless sensor networks. Accurate calibration of between-node distances is one crucial step in localizing sensor n...
Jung Jin Cho, Yu Ding, Yong Chen, Jiong Tang
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
14 years 10 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
SPAA
2009
ACM
14 years 10 months ago
Towards transactional memory semantics for C++
Transactional memory (TM) eliminates many problems associated with lock-based synchronization. Over recent years, much progress has been made in software and hardware implementati...
Tatiana Shpeisman, Ali-Reza Adl-Tabatabai, Robert ...
HPCA
2001
IEEE
14 years 10 months ago
CARS: A New Code Generation Framework for Clustered ILP Processors
Clustered ILP processors are characterized by a large number of non-centralized on-chip resources grouped into clusters. Traditional code generation schemes for these processors c...
Krishnan Kailas, Kemal Ebcioglu, Ashok K. Agrawala