2124 search results - page 149 / 425 » Aggregating time partitions |
145
click to vote
MFCS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
122
click to vote
SSD
2001
Springer
15 years 8 months ago
2001
Springer
The notion of time granularity comes into play in a variety of problems involving time representation and management in database applications, including temporal database design, t...
143
click to vote
ML
2000
ACM
15 years 3 months ago
2000
ACM
We present an approach to inductive concept learning using multiple models for time series. Our objective is to improve the efficiency and accuracy of concept learning by decomposi...
124
Voted
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
131
Voted
GLOBECOM
2007
IEEE
15 years 10 months ago
2007
IEEE
— Differential Unitary Space-Time Block codes (STBCs) offer a means to communicate on the Multiple Input Multiple Output (MIMO) channel without the need for channel knowledge at ...