Sciweavers

4117 search results - page 485 / 824
» On the Satisfiability of Complex Constraints
Sort
View
206
Voted
ICWE
2004
Springer
16 years 7 days ago
Behaviour Recovery and Complicated Pattern Definition in Web Usage Mining
Data mining includes four steps: data preparation, pattern mining, and pattern analysis and pattern application. But in web environment, the user activities become much more comple...
Long Wang 0002, Christoph Meinel
198
Voted
GRID
2003
Springer
16 years 2 days ago
Scoped and Approximate Queries in a Relational Grid Information Service
We are developing a grid information service, RGIS, that is based on the relational data model. RGIS supports complex queries written in SQL that search for compositions (using jo...
Dong Lu, Peter A. Dinda, Jason A. Skicewicz
CONEXT
2008
ACM
15 years 8 months ago
Towards systematic design of enterprise networks
Enterprise networks are important, with size and complexity even surpassing carrier networks. Yet, the design of enterprise networks remains ad-hoc and poorly understood. In this p...
Yu-Wei Eric Sung, Sanjay G. Rao, Geoffrey G. Xie, ...
183
Voted
CDC
2009
IEEE
124views Control Systems» more  CDC 2009»
15 years 8 months ago
Blocking parameterizations for improving the computational tractability of affine disturbance feedback MPC problems
Many model predictive control (MPC) schemes suffer from high computational complexity. Especially robust MPC schemes, which explicitly account for the effects of disturbances, can ...
Frauke Oldewurtel, Ravi Gondhalekar, Colin Neil Jo...
AUTOMATICA
2008
139views more  AUTOMATICA 2008»
15 years 7 months ago
Structured low-rank approximation and its applications
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
Ivan Markovsky