Sciweavers

10051 search results - page 1463 / 2011
» A Dynamic Separator Algorithm
Sort
View
IEAAIE
2009
Springer
16 years 1 months ago
Incremental Mining of Ontological Association Rules in Evolving Environments
The process of knowledge discovery from databases is a knowledge intensive, highly user-oriented practice, thus has recently heralded the development of ontology-incorporated data ...
Ming-Cheng Tseng, Wen-Yang Lin
SIGIR
2009
ACM
16 years 29 days ago
Temporal collaborative filtering with adaptive neighbourhoods
Recommender Systems, based on collaborative filtering (CF), aim to accurately predict user tastes, by minimising the mean error achieved on hidden test sets of user ratings, afte...
Neal Lathia, Stephen Hailes, Licia Capra
IROS
2008
IEEE
171views Robotics» more  IROS 2008»
16 years 25 days ago
Action planner of hybrid leg-wheel robots for lunar and planetary exploration
— In this paper, we propose an action planning algorithm and its evaluation method based on dynamic simulation for a novel type of hybrid leg-wheel rover for planetary exploratio...
Eric Rohmer, Giulio Reina, Genya Ishigami, Keiji N...
INFOCOM
2007
IEEE
16 years 22 days ago
Multicast Scheduling in Cellular Data Networks
— Multicast is an efficient means of transmitting the same content to multiple receivers while minimizing network resource usage. Applications that can benefit from multicast s...
Hyungsuk Won, Han Cai, Do Young Eun, Katherine Guo...
PLDI
2006
ACM
16 years 12 days ago
DieHard: probabilistic memory safety for unsafe languages
Applications written in unsafe languages like C and C++ are vulnerable to memory errors such as buffer overflows, dangling pointers, and reads of uninitialized data. Such errors ...
Emery D. Berger, Benjamin G. Zorn
« Prev « First page 1463 / 2011 Last » Next »