Sciweavers

1955 search results - page 83 / 391
» Can Computers Handle Adverbs
Sort
View
135
Voted
IPPS
1999
IEEE
15 years 8 months ago
Parallel Out-of-Core Divide-and-Conquer Techniques with Application to Classification Trees
Classification is an important problem in the field of data mining. Construction of good classifiers is computationally intensive and offers plenty of scope for parallelization. D...
Mahesh K. Sreenivas, Khaled Alsabti, Sanjay Ranka
PDIS
1996
IEEE
15 years 8 months ago
Capabilities-Based Query Rewriting in Mediator Systems
Users today are struggling to integrate a broad range of information sources providing di erent levels of query capabilities. Currently, data sources with di erent and limitedcapa...
Yannis Papakonstantinou, Ashish Gupta, Laura M. Ha...
ISHPC
1997
Springer
15 years 8 months ago
Implementing Iterative Solvers for Irregular Sparse Matrix Problems in High Performance Fortran
Abstract. Writing e cient iterative solvers for irregular, sparse matrices in HPF is hard. The locality in the computations is unclear, and for e ciency we use storage schemes that...
Eric de Sturler, Damian Loher
129
Voted
ACMICEC
2007
ACM
127views ECommerce» more  ACMICEC 2007»
15 years 8 months ago
Decentralized task allocation using magnet: an empirical evaluation in the logistics domain
This paper presents a decentralized task allocation method that can handle allocation of tasks with time and precedence constraints in a multi-agent setting where not all informat...
Mark Hoogendoorn, Maria L. Gini, Catholijn M. Jonk...
CGF
2010
167views more  CGF 2010»
15 years 1 months ago
Chain Shape Matching for Simulating Complex Hairstyles
Animations of hair dynamics greatly enrich the visual attractiveness of human characters. Traditional simulation techniques handle hair as clumps or continuum for efficiency; howe...
Witawat Rungjiratananon, Yoshihiro Kanamori, Tomoy...