Sciweavers

4491 search results - page 809 / 899
» Algorithm Engineering
Sort
View
IPPS
2009
IEEE
14 years 4 months ago
Input-independent, scalable and fast string matching on the Cray XMT
String searching is at the core of many security and network applications like search engines, intrusion detection systems, virus scanners and spam filters. The growing size of o...
Oreste Villa, Daniel G. Chavarría-Miranda, ...
CIKM
2009
Springer
14 years 3 months ago
Helping editors choose better seed sets for entity set expansion
Sets of named entities are used heavily at commercial search engines such as Google, Yahoo and Bing. Acquiring sets of entities typically consists of combining semi-supervised exp...
Vishnu Vyas, Patrick Pantel, Eric Crestan
CIKM
2009
Springer
14 years 3 months ago
Potential collaboration discovery using document clustering and community structure detection
Complex network analysis is a growing research area in a wide variety of domains and has recently become closely associated with data, text and web mining. One of the most active ...
Cristian Klen dos Santos, Alexandre Evsukoff, Beat...
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
14 years 3 months ago
Approximability of OFDMA Scheduling
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
Marcel Ochel, Berthold Vöcking
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
14 years 3 months ago
On the Power of Uniform Power: Capacity of Wireless Networks with Bounded Resources
Abstract. The throughput capacity of arbitrary wireless networks under the physical Signal to Interference Plus Noise Ratio (SINR) model has received a greater deal of attention in...
Chen Avin, Zvi Lotker, Yvonne Anne Pignolet