Sciweavers

1951 search results - page 255 / 391
» An algorithm for improving graph partitions
Sort
View
CIIT
2004
15 years 6 months ago
Speeding up keyword search for search engines
In the current information age, the dominant method for information search is by providing few keywords to a search engine. Keyword search is currently one of the most important o...
Sanjay Baberwal, Ben Choi
AAMAS
2010
Springer
15 years 4 months ago
Multi-goal economic search using dynamic search structures
This paper investigates cooperative search strategies for agents engaged in costly search in a complex environment. Searching cooperatively, several search goals can be satisfied w...
David Sarne, Efrat Manisterski, Sarit Kraus
152
Voted
MCS
2007
Springer
15 years 4 months ago
Parallel unstructured mesh generation by an advancing front method
Mesh generation is a critical step in high fidelity computational simulations. High-quality and high-density meshes are required to accurately capture the complex physical phenome...
Yasushi Ito, Alan M. Shih, Anil K. Erukala, Bharat...
IPPS
2010
IEEE
15 years 2 months ago
Exploiting inter-thread temporal locality for chip multithreading
Multi-core organizations increasingly support multiple threads per core. Threads on a core usually share a single first-level data cache, so thread schedulers must try to minimize ...
Jiayuan Meng, Jeremy W. Sheaffer, Kevin Skadron
142
Voted
ICASSP
2011
IEEE
14 years 8 months ago
Co-clustering as multilinear decomposition with sparse latent factors
The K-means clustering problem seeks to partition the columns of a data matrix in subsets, such that columns in the same subset are ‘close’ to each other. The co-clustering pr...
Evangelos E. Papalexakis, Nicholas D. Sidiropoulos