Sciweavers

160 search results - page 5 / 32
» Ranking under temporal constraints
Sort
View
ICALP
2010
Springer
13 years 11 months ago
The Positive Semidefinite Grothendieck Problem with Rank Constraint
Given a positive integer n and a positive semidefinite matrix A = (Aij ) ∈ Rm×m the positive semidefinite Grothendieck problem with rank-nconstraint is (SDPn) maximize mX i=1 ...
Jop Briët, Fernando Mário de Oliveira ...
JCIT
2010
182views more  JCIT 2010»
13 years 1 months ago
CT-Rank: A Time-aware Ranking Algorithm for Web Search
Time plays important roles in Web search, because most Web pages contain time information and a lot of Web queries are time-related. However, traditional search engines such as Go...
Peiquan Jin, Xiaowen Li, Hong Chen, Lihua Yue
ICDE
2008
IEEE
214views Database» more  ICDE 2008»
14 years 8 months ago
Efficient Online Subsequence Searching in Data Streams under Dynamic Time Warping Distance
Abstract- Data streams of real numbers are generated naturally in many applications. The technology of online subsequence searching in data streams becomes more and more important ...
Mi Zhou, Man Hon Wong
RTSS
1996
IEEE
13 years 11 months ago
Scheduling transactions with temporal constraints: exploiting data semantics
In this paper, issues involved in the design of a real-time database which maintains data temporal consistency are discussed. The concept of data-deadline is introduced and time co...
Ming Xiong, Rajendran M. Sivasankaran, John A. Sta...
IJCAI
2003
13 years 8 months ago
Temporal Reasoning with Preferences and Uncertainty
Temporal Constraint Satisfaction Problems allow for reasoning with events happening over time. Their expressiveness has been extended independently in two directions: to account f...
Neil Yorke-Smith, Kristen Brent Venable, Francesca...