Sciweavers

18306 search results - page 514 / 3662
» Algorithmics in Exponential Time
Sort
View
CIKM
2008
Springer
15 years 9 months ago
Query suggestion using hitting time
Generating alternative queries, also known as query suggestion, has long been proved useful to help a user explore and express his information need. In many scenarios, such sugges...
Qiaozhu Mei, Dengyong Zhou, Kenneth Ward Church
211
Voted
SDM
2007
SIAM
198views Data Mining» more  SDM 2007»
15 years 9 months ago
Learning from Time-Changing Data with Adaptive Windowing
We present a new approach for dealing with distribution change and concept drift when learning from data sequences that may vary with time. We use sliding windows whose size, inst...
Albert Bifet, Ricard Gavaldà
JDA
2008
72views more  JDA 2008»
15 years 7 months ago
Semi-local longest common subsequences in subquadratic time
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, ...
Alexander Tiskin
JUCS
2010
142views more  JUCS 2010»
15 years 6 months ago
Mobile Agent Routing with Time Constraints: A Resource Constrained Longest-Path Approach
: Mobile agent technology advocates the mobility of code rather than the transfer of data. As data is found in several sites, a mobile agent has to plan an itinerary to visit sever...
Eduardo Camponogara, Ricardo Boveto Shima
ICASSP
2011
IEEE
14 years 11 months ago
Joint data detection and dominant singular mode estimation in time varying reciprocal MIMO systems
This paper proposes an algorithm for joint data detection and tracking of the dominant singular mode of a time varying channel at the transmitter and receiver of a time division d...
Ranjitha Prasad, Bettagere Nagaraja Bharath, Chand...