Sciweavers

4850 search results - page 970 / 970
» Approximate Data Structures with Applications
Sort
View
SAC
2011
ACM
12 years 8 months ago
Type harvesting: a practical approach to obtaining typing information in dynamic programming languages
Dynamically typed programming languages are powerful tools for rapid software development. However, there are scenarios that would benefit from actual type information being avai...
Michael Haupt, Michael Perscheid, Robert Hirschfel...
CIKM
2011
Springer
12 years 5 months ago
Content based social behavior prediction: a multi-task learning approach
The study of information flow analyzes the principles and mechanisms of social information distribution. It is becoming an extremely important research topic in social network re...
Hongliang Fei, Ruoyi Jiang, Yuhao Yang, Bo Luo, Ju...
EDBT
2012
ACM
299views Database» more  EDBT 2012»
11 years 7 months ago
RecStore: an extensible and adaptive framework for online recommender queries inside the database engine
Most recommendation methods (e.g., collaborative filtering) consist of (1) a computationally intense offline phase that computes a recommender model based on users’ opinions o...
Justin J. Levandoski, Mohamed Sarwat, Mohamed F. M...
P2P
2008
IEEE
222views Communications» more  P2P 2008»
13 years 11 months ago
IgorFs: A Distributed P2P File System
IgorFs is a distributed, decentralized peer-to-peer (P2P) file system that is completely transparent to the user. It is built on top of the Igor peer-to-peer overlay network, whi...
Bernhard Amann, Benedikt Elser, Yaser Houri, Thoma...
FUN
2010
Springer
312views Algorithms» more  FUN 2010»
13 years 10 months ago
On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching
Given a string s, the Parikh vector of s, denoted p(s), counts the multiplicity of each character in s. Searching for a match of Parikh vector q (a “jumbled string”) in the tex...
Peter Burcsi, Ferdinando Cicalese, Gabriele Fici, ...